Stratified graphs for imbedding systems

Homogeneously Embedding Stratified Graphs in Stratified Graphs

A 2-stratified graph G is a graph whose vertex set has been partitioned into two subsets, called the strata or color classes of G. Two 2-stratified graphs G and H are isomorphic if there exists a color-preserving isomorphism φ from G to H. A 2-stratified graph G is said to be homogeneously embedded in a 2-stratified graph H if for every vertex x of G and every vertex y of H, where x and y are c...

channel estimation for mimo-ofdm systems

تخمین دقیق مشخصات کانال در سیستم های مخابراتی یک امر مهم محسوب می گردد. این امر به ویژه در کانال های بیسیم با ‏خاصیت فرکانس گزینی و زمان گزینی شدید، چالش بزرگی است. مقالات متعدد پر از روش های مبتکرانه ای برای طراحی و آنالیز ‏الگوریتم های تخمین کانال است که بیشتر آنها از روش های خاصی استفاده می کنند که یا دارای عملکرد خوب با پیچیدگی ‏محاسباتی بالا هستند و یا با عملکرد نه چندان خوب پیچیدگی پایینی...

Realizable Triples for Stratified Domination in Graphs

A graph is 2-stratified if its vertex set is partitioned into two classes, where the vertices in one class are colored red and those in the other class are colored blue. Let F be a 2-stratified graph rooted at some blue vertex v. An F -coloring of a graph G is a red-blue coloring of the vertices of G in which every blue vertex v belongs to a copy of F rooted at v. The F -domination number γF (G...

On Stratified Domination in Oriented Graphs

An oriented graph is 2-stratified if its vertex set is partitioned into two classes, where the vertices in one class are colored red and those in the other class are colored blue. Let H be a 2-stratified oriented graph rooted at some blue vertex. An H-coloring of an oriented graph D is a red-blue coloring of the vertices of D in which every blue vertex v belongs to a copy of H rooted at v in D....

Generalized Invariant Imbedding Relation.